0.10/0.12 % Problem : Vampire---4.8_26997 : TPTP v0.0.0. Released v0.0.0. 0.10/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n022.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1440 0.13/0.34 % WCLimit : 180 0.13/0.34 % DateTime : Mon Jul 3 13:01:59 EDT 2023 0.13/0.34 % CPUTime : 0.19/0.47 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.eElkeloaba/Vampire---4.8_26997 0.19/0.47 # Version: 3.1pre001-ho 0.19/0.48 # Preprocessing class: HSMSSMSMSSSNSSA. 0.19/0.48 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.19/0.48 # Starting ho_unfolding_3 with 900s (5) cores 0.19/0.48 # Starting ehoh_best_sine_rwall with 180s (1) cores 0.19/0.48 # Starting sh5l with 180s (1) cores 0.19/0.48 # Starting new_bool_3 with 180s (1) cores 0.19/0.48 # ehoh_best_sine_rwall with pid 27176 completed with status 0 0.19/0.48 # Result found by ehoh_best_sine_rwall 0.19/0.48 # Preprocessing class: HSMSSMSMSSSNSSA. 0.19/0.48 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.19/0.48 # Starting ho_unfolding_3 with 900s (5) cores 0.19/0.48 # Starting ehoh_best_sine_rwall with 180s (1) cores 0.19/0.48 # SinE strategy is gf500_gu_R04_F100_L20000 0.19/0.48 # Search class: HGHSF-FFMM11-SSSFFFBN 0.19/0.48 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.19/0.48 # Starting ho_unfolding_3 with 109s (1) cores 0.19/0.48 # ho_unfolding_3 with pid 27180 completed with status 0 0.19/0.48 # Result found by ho_unfolding_3 0.19/0.48 # Preprocessing class: HSMSSMSMSSSNSSA. 0.19/0.48 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.19/0.48 # Starting ho_unfolding_3 with 900s (5) cores 0.19/0.48 # Starting ehoh_best_sine_rwall with 180s (1) cores 0.19/0.48 # SinE strategy is gf500_gu_R04_F100_L20000 0.19/0.48 # Search class: HGHSF-FFMM11-SSSFFFBN 0.19/0.48 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.19/0.48 # Starting ho_unfolding_3 with 109s (1) cores 0.19/0.48 # Preprocessing time : 0.002 s 0.19/0.48 # Presaturation interreduction done 0.19/0.48 0.19/0.48 # Proof found! 0.19/0.48 # SZS status Theorem 0.19/0.48 # SZS output start CNFRefutation 0.19/0.48 thf(decl_30, type, lAnna_THFTYPE_i: $i). 0.19/0.48 thf(decl_33, type, lBill_THFTYPE_i: $i). 0.19/0.48 thf(decl_35, type, lBob_THFTYPE_i: $i). 0.19/0.48 thf(decl_36, type, lMary_THFTYPE_i: $i). 0.19/0.48 thf(decl_38, type, lSue_THFTYPE_i: $i). 0.19/0.48 thf(decl_39, type, likes_THFTYPE_IiioI: $i > $i > $o). 0.19/0.48 thf(decl_42, type, parent_THFTYPE_IiioI: $i > $i > $o). 0.19/0.48 thf(con, conjecture, ?[X4:$i > $i > $o, X5:$i > $i > $o, X6:$i]:((((X4 @ X6 @ lAnna_THFTYPE_i)&~(((X5)=(X4))))&(X5 @ X6 @ lBill_THFTYPE_i))), file('/export/starexec/sandbox/tmp/tmp.eElkeloaba/Vampire---4.8_26997', con)). 0.19/0.48 thf(ax, axiom, (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i), file('/export/starexec/sandbox/tmp/tmp.eElkeloaba/Vampire---4.8_26997', ax)). 0.19/0.48 thf(ax_013, axiom, (parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i), file('/export/starexec/sandbox/tmp/tmp.eElkeloaba/Vampire---4.8_26997', ax_013)). 0.19/0.48 thf(ax_026, axiom, ~((parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i)), file('/export/starexec/sandbox/tmp/tmp.eElkeloaba/Vampire---4.8_26997', ax_026)). 0.19/0.48 thf(ax_018, axiom, (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i), file('/export/starexec/sandbox/tmp/tmp.eElkeloaba/Vampire---4.8_26997', ax_018)). 0.19/0.48 thf(ax_022, axiom, (likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i), file('/export/starexec/sandbox/tmp/tmp.eElkeloaba/Vampire---4.8_26997', ax_022)). 0.19/0.48 thf(c_0_6, negated_conjecture, ~(?[X4:$i > $i > $o, X5:$i > $i > $o, X6:$i]:((((X4 @ X6 @ lAnna_THFTYPE_i)&((X5)!=(X4)))&(X5 @ X6 @ lBill_THFTYPE_i)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])])). 0.19/0.48 thf(c_0_7, negated_conjecture, ![X59:$i > $i > $o, X60:$i > $i > $o, X61:$i]:((~(X59 @ X61 @ lAnna_THFTYPE_i)|((X60)=(X59))|~(X60 @ X61 @ lBill_THFTYPE_i))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])). 0.19/0.48 thf(c_0_8, negated_conjecture, ![X5:$i > $i > $o, X4:$i > $i > $o, X1:$i]:((((X5)=(X4))|~((X4 @ X1 @ lAnna_THFTYPE_i))|~((X5 @ X1 @ lBill_THFTYPE_i)))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.19/0.48 thf(c_0_9, plain, (likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i), inference(split_conjunct,[status(thm)],[ax])). 0.19/0.48 thf(c_0_10, negated_conjecture, ![X4:$i > $i > $o]:((((X4)=(likes_THFTYPE_IiioI))|~((X4 @ lSue_THFTYPE_i @ lAnna_THFTYPE_i)))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 0.19/0.48 thf(c_0_11, plain, (parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i), inference(split_conjunct,[status(thm)],[ax_013])). 0.19/0.48 thf(c_0_12, negated_conjecture, ![X95:$i, X94:$i, X4:$i > $i > $o]:((((X4 @ X94 @ X95)<=>(likes_THFTYPE_IiioI @ X94 @ X95))|~((X4 @ lSue_THFTYPE_i @ lAnna_THFTYPE_i)))), inference(arg_cong,[status(thm)],[c_0_10])). 0.19/0.48 thf(c_0_13, negated_conjecture, ((likes_THFTYPE_IiioI)=(parent_THFTYPE_IiioI)), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.19/0.48 thf(c_0_14, negated_conjecture, ![X1:$i, X4:$i > $i > $o, X2:$i]:(((X4 @ X1 @ X2)|~((X4 @ lSue_THFTYPE_i @ lAnna_THFTYPE_i))|~((likes_THFTYPE_IiioI @ X1 @ X2)))), inference(dynamic_cnf,[status(thm)],[c_0_12])). 0.19/0.48 thf(c_0_15, negated_conjecture, ![X96:$i, X97:$i]:(((likes_THFTYPE_IiioI @ X96 @ X97)<=>(parent_THFTYPE_IiioI @ X96 @ X97))), inference(arg_cong,[status(thm)],[c_0_13])). 0.19/0.48 thf(c_0_16, plain, ~(parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i), inference(fof_simplification,[status(thm)],[ax_026])). 0.19/0.48 thf(c_0_17, negated_conjecture, ![X2:$i, X1:$i]:((((lAnna_THFTYPE_i)=(X1))|~((likes_THFTYPE_IiioI @ X2 @ X1)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_14])). 0.19/0.48 thf(c_0_18, plain, (likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i), inference(split_conjunct,[status(thm)],[ax_018])). 0.19/0.48 thf(c_0_19, negated_conjecture, ![X1:$i, X2:$i]:(((parent_THFTYPE_IiioI @ X1 @ X2)|~((likes_THFTYPE_IiioI @ X1 @ X2)))), inference(dynamic_cnf,[status(thm)],[c_0_15])). 0.19/0.48 thf(c_0_20, plain, (likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i), inference(split_conjunct,[status(thm)],[ax_022])). 0.19/0.48 thf(c_0_21, plain, ~((parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.19/0.48 thf(c_0_22, negated_conjecture, ((lAnna_THFTYPE_i)=(lBill_THFTYPE_i)), inference(spm,[status(thm)],[c_0_17, c_0_18])). 0.19/0.48 thf(c_0_23, negated_conjecture, (parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.19/0.48 thf(c_0_24, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_22]), c_0_23])]), ['proof']). 0.19/0.48 # SZS output end CNFRefutation 0.19/0.48 # Parsed axioms : 71 0.19/0.48 # Removed by relevancy pruning/SinE : 28 0.19/0.48 # Initial clauses : 48 0.19/0.48 # Removed in clause preprocessing : 5 0.19/0.48 # Initial clauses in saturation : 43 0.19/0.48 # Processed clauses : 115 0.19/0.48 # ...of these trivial : 7 0.19/0.48 # ...subsumed : 17 0.19/0.48 # ...remaining for further processing : 91 0.19/0.48 # Other redundant clauses eliminated : 0 0.19/0.48 # Clauses deleted for lack of memory : 0 0.19/0.48 # Backward-subsumed : 0 0.19/0.48 # Backward-rewritten : 21 0.19/0.48 # Generated clauses : 75 0.19/0.48 # ...of the previous two non-redundant : 81 0.19/0.48 # ...aggressively subsumed : 0 0.19/0.48 # Contextual simplify-reflections : 0 0.19/0.48 # Paramodulations : 39 0.19/0.48 # Factorizations : 0 0.19/0.48 # NegExts : 0 0.19/0.48 # Equation resolutions : 0 0.19/0.48 # Total rewrite steps : 52 0.19/0.48 # Propositional unsat checks : 0 0.19/0.48 # Propositional check models : 0 0.19/0.48 # Propositional check unsatisfiable : 0 0.19/0.48 # Propositional clauses : 0 0.19/0.48 # Propositional clauses after purity: 0 0.19/0.48 # Propositional unsat core size : 0 0.19/0.48 # Propositional preprocessing time : 0.000 0.19/0.48 # Propositional encoding time : 0.000 0.19/0.48 # Propositional solver time : 0.000 0.19/0.48 # Success case prop preproc time : 0.000 0.19/0.48 # Success case prop encoding time : 0.000 0.19/0.48 # Success case prop solver time : 0.000 0.19/0.48 # Current number of processed clauses : 35 0.19/0.48 # Positive orientable unit clauses : 21 0.19/0.48 # Positive unorientable unit clauses: 0 0.19/0.48 # Negative unit clauses : 3 0.19/0.48 # Non-unit-clauses : 11 0.19/0.48 # Current number of unprocessed clauses: 31 0.19/0.48 # ...number of literals in the above : 73 0.19/0.48 # Current number of archived formulas : 0 0.19/0.48 # Current number of archived clauses : 56 0.19/0.48 # Clause-clause subsumption calls (NU) : 152 0.19/0.48 # Rec. Clause-clause subsumption calls : 111 0.19/0.48 # Non-unit clause-clause subsumptions : 14 0.19/0.48 # Unit Clause-clause subsumption calls : 65 0.19/0.48 # Rewrite failures with RHS unbound : 0 0.19/0.48 # BW rewrite match attempts : 4 0.19/0.48 # BW rewrite match successes : 3 0.19/0.48 # Condensation attempts : 115 0.19/0.48 # Condensation successes : 1 0.19/0.48 # Termbank termtop insertions : 3710 0.19/0.48 0.19/0.48 # ------------------------------------------------- 0.19/0.48 # User time : 0.011 s 0.19/0.48 # System time : 0.001 s 0.19/0.48 # Total time : 0.012 s 0.19/0.48 # Maximum resident set size: 1928 pages 0.19/0.48 0.19/0.48 # ------------------------------------------------- 0.19/0.48 # User time : 0.014 s 0.19/0.48 # System time : 0.003 s 0.19/0.48 # Total time : 0.016 s 0.19/0.48 # Maximum resident set size: 1780 pages 0.19/0.48 % E---3.1 exiting 0.19/0.49 EOF